Complexity function - PDFSEARCH.IO - Document Search Engine

Complexity function
Results: 282

#	Item
71	Journal of Computer and System Sciences–737 Contents lists available at ScienceDirect Journal of Computer and System Sciences www.elsevier.com/locate/jcss Add to Reading List Source URL: math.mit.edu Language: English - Date: 2011-03-23 10:26:18 Applied mathematics Natural proof Pseudorandom generator Entailment Time complexity Circuit complexity Arithmetic function Holomorphic functional calculus Theoretical computer science Computational complexity theory Logic
72	Boolean Decision Functions Steven Finch April 22, 2015 Let  : {0 1} → {0 1} be the Boolean function that decides whether a given ( + 1)-bit odd integer is square-free. More precisely, ½ Add to Reading List Source URL: www.people.fas.harvard.edu Language: English - Date: 2015-04-21 10:31:24 Integer sequences Algebra Polynomials FO Computational complexity theory Prime number Primality test Square-free integer Irreducible polynomial Mathematics Theoretical computer science Complexity classes
73	arXiv:1403.6863v1 [cs.LG] 26 MarOnline Learning of k-CNF Boolean Functions Joel Veness Marcus Hutter Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-03-27 20:30:51 Boolean algebra Machine learning Bayesian statistics Time complexity Supervised learning Bayesian inference Algorithm Boolean function PP Theoretical computer science Applied mathematics Computational complexity theory
74	Random Generation Boltzmann Framework Boltzmann Samplers Size Control and Complexity Boltzmann Sampling and Random Generation of Add to Reading List Source URL: algo.inria.fr Language: English - Date: 2006-09-10 09:49:12 Markov chain Ludwig Boltzmann Surjective function Combinatorics Mathematics Markov models Mathematical analysis
75	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals Alexander Idelberger∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-27 21:29:04 Auxiliary function NP-complete problems Mathematics Forcing 8J
76	Complete Fairness in Secure Two-Party Computation∗ S. Dov Gordon Carmit Hazay Jonathan Katz Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2008-07-05 10:54:06 Cryptography Quantum complexity theory PP Secure multi-party computation Secure two-party computation Verifiable secret sharing Function Transmission Control Protocol Cryptographic protocols Mathematics Applied mathematics
77	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-01-05 09:50:09 Complexity classes Approximation algorithms NP-complete problems Matroid theory Generalized assignment problem Knapsack problem Submodular set function APX Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
78	Shannon Information and Kolmogorov Complexity Peter Gr¨ unwald and Paul Vit´anyi∗ July 22, 2010 Abstract Add to Reading List Source URL: homepages.cwi.nl Language: English - Date: 2010-07-22 12:09:06 Information Randomness Statistical theory Algorithmic information theory Computability theory Kolmogorov structure function Entropy Kolmogorov complexity Mutual information Information theory Theoretical computer science Mathematics
79	counting colours in compressed strings Travis Gagie Juha K¨arkk¨ainen CPM 2011 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-22 14:04:56 Arithmetic functions Analysis of algorithms Asymptotic analysis Mathematical notation Number theory Computational complexity of mathematical operations Chebyshev function Mathematics Mathematical analysis Theoretical computer science
80	CS109A Notes for LecturePrograms with Function Calls Establish a size measure for each function. Let f ( ) be the running time of function . When evaluating a simple or compound staten Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:57:58 Computer science Mathematical notation Asymptotic analysis Functional languages Procedural programming languages Big O notation Time complexity Summation ML Theoretical computer science Mathematics Analysis of algorithms

UPDATE